Optimal stopping for many connected components in a graph
نویسندگان
چکیده
منابع مشابه
Optimal Algorithms for Finding Connected Components of an Unknown Graph
We want to nd the connected components of an unknown graph G with a known vertex set V. We learn about G by sending an oracle a query set S V , and the oracle tells us the vertices connected to S. We want to use the minimum number of queries, adaptively, to nd the components. The problem is also known as interconnect diagnosis of wiring networks in VLSI. The graph has n vertices and k component...
متن کاملStrongly connected components-Algorithm for finding the strongly connected components of a graph
A directed graph G (V, E) is strongly connected if and only if, for any pair of vertices X and Y from V, there exists a path from X to Y and a path from Y to X. In Computer Science, the partition of a graph in strongly connected components is represented by the partition of all vertices from the graph, so that for any two vertices, X and Y, from the same partition, there exists a path from X to...
متن کاملStrongly Connected Components in Graph Streams
Frequently studied networks, such as social networks, are often massive, directed, and change over time. Thus studying network analysis algorithms in terms of data streaming is a practical model for understanding how companies and other organizations can process data in a useful, realistic way. One potentially interesting feature of a directed graph is strongly connected components. We design a...
متن کاملOn Finding the Strongly Connected Components in a Directed Graph
We present two improved versions of Tarjan's algorithm for the detection of strongly connected components in a directed graph. Our new algorithms handle sparse graphs and graphs with many trivial components (containing only one node) more economically than Tarjan's original algorithm. As an application we present an eecient transitive closure algorithm.
متن کاملSome GPU Algorithms for Graph Connected Components and Spanning Tree
Graphics Processing Units (GPU) are application specific accelerators which provide high performance to cost ratio and are widely available and used, hence places them as a ubiquitous accelerator. A computing paradigm based on the same is the general purpose computing on the GPU (GPGPU) model. The GPU due to its graphics lineage is better suited for the data-parallel, data-regular algorithms. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2021
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.21000